- cryptographically strong
- стойкий к криптографическому анализу, криптостойкий
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
Cryptographically strong — This term cryptographically strong is often used to describe an encryption algorithm, and implies, in comparison to some other algorithm (which is thus cryptographically weak), greater resistance to attack. But it can also be used to describe… … Wikipedia
Strong cryptography — or cryptographically strong are general terms applied cryptographic systems or components that are considered highly resistant to cryptanalysis. Demonstrating the resistance of any cryptographic scheme to attack is a complex matter, requiring… … Wikipedia
Cryptographically secure pseudorandom number generator — A cryptographically secure pseudo random number generator (CSPRNG) is a pseudo random number generator (PRNG) with properties that make it suitable for use in cryptography. Many aspects of cryptography require random numbers, for example: Key… … Wikipedia
Strong prime — In mathematics, a strong prime is a prime number with certain special properties. The definitions of strong primes are different in cryptography and number theory. Definition in cryptography In cryptography, a prime number p is strong if the… … Wikipedia
Electronic envelope — An electronic envelope or e envelope is almost like a postal Envelope in function. Where a paper Envelope privately encloses its contents like a mail message, so an Electronic envelope privately encloses its contents like an e mail message.… … Wikipedia
VEST — High Level Structure of VEST General Designers Sean O Neil First published June 13, 2005 Cipher deta … Wikipedia
Random self-reducibility — (RSR): A good algorithm for the average case implies a good algorithm for the worst case. RSR is the ability to solve all instances of a problem by solving a large fraction of the instances.DefinitionIf a function f evaluating any instance x can… … Wikipedia
Pearson hashing — Fast Hashing of Variable Length Text Strings . Peter K. Pearson, Communications of the ACM 33(6), 677 (1990) mdash; [http://portal.acm.org/citation.cfm?id=78978 ACM full text (requires subscription)] ] is a hash function designed for fast… … Wikipedia
Silvio Micali — Infobox Scientist name = Silvio Micali image width = caption = birth date = 1954 birth place = Palermo, Italy death date = death place = residence = citizenship = United States nationality = ethnicity = field = Computer Science, Cryptography work … Wikipedia
CCM mode — (Counter with CBC MAC) is a mode of operation for cryptographic block ciphers. It is an authenticated encryption algorithm designed to provide both authentication and privacy. CCM mode is only defined for block ciphers with a block length of 128… … Wikipedia
Pseudorandom generator theorem — In computational complexity a distribution is considered pseudorandom if no efficient computation can distinguish it from the true uniform distribution by a non negligible advantage. Formally, a family of distributions Dn is pseudorandom if for… … Wikipedia